Testing Non-deterministic Stream X-machine Models and P systems

نویسندگان

  • Florentin Ipate
  • Marian Gheorghe
چکیده

Under certain well defined conditions, the stream X-machine testing method can produce a test set that is guaranteed to determine the correctness of an implementation. The testing method has originally assumed that an implementation of each processing function or relation is proven to be correct before the actual testing can take place. Such a limitation has been removed in a subsequent paper, but only for deterministic X-machines. This paper extends this result to non-deterministic stream X-machines and considers a conformance relationship between a specification and an implementation, rather than mere equivalence. Furthermore, it shows how this method can be applied to test a P system by building a suitable stream X-machine from the derivation tree associated with a partial computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing conformance of a deterministic implementation against a non-deterministic stream X-machine

Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently b...

متن کامل

Deterministic Stream X - machinesBased on Grammar

This paper investigates the power of the stream X-machines based on cooperating distributed grammar systems which replaces relations by functions. The case of regular rules is considered. The deterministic case is introduced in order to allow the application of some already developed testing strategies. Some conditions for getting equivalent stream X-machines in the = 1 derivation mode are stud...

متن کامل

Deterministic stream X-machines based on grammar systems

This paper investigates the power of the stream X machines ba sed on cooperating distributed grammar systems which replaces relations by functions The case of regular rules is considered The deterministic case is introduced in order to allow the application of some already deve loped testing strategies Some conditions for getting equivalent stream X machines in the derivation mode are studied

متن کامل

X-Machine Based Testing for Cloud Services

In this article we present a tool designed for cloud service testing, able to generate test cases from a formal specification of the service, in form of a deterministic stream X-machine (DSXM) model. The paper summarizes the theoretical foundations of X-machine based testing and illustrates the usage of the developed tool on some examples. It shows in detail how the specification should be writ...

متن کامل

Testing data processing-oriented systems from stream X-machine models

One of the great benefits of using a stream X-machine to specify a system is its associated testing method. Under certain design for test conditions, this method produces a test suite that can determine the correctness of the implementation under test (IUT), provided that the processing functions of the stream X-machine specification have been correctly implemented. The method was originally de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 227  شماره 

صفحات  -

تاریخ انتشار 2009